Performance Analysis of a Neural Network based Scheduling Algorithm
Identifieur interne : 00CB27 ( Main/Exploration ); précédent : 00CB26; suivant : 00CB28Performance Analysis of a Neural Network based Scheduling Algorithm
Auteurs : C. Cardeira ; Z. MammeriSource :
English descriptors
Abstract
In this paper, it is our purpose to analyse the use of artificial neural networks (ANNs) to approximate solving scheduling problems. It is well established that the ANN main advantage is the few amount of time they take to find an approximate solution, but a question arises\, : what about the optimality of the obtained solution ? A considerable variety of work has been carried out on this subject but, unfortunately, the majority of the studies have focused on the analysis of the classical TSP problem. The obtained results are useful as a reference but can not be directly extrapolated for real-time systems. It is our aim to analyse the behaviour of an ANN based scheduling algorithm when scheduling tasks in a real-time system, using the baseline task set from the Hartstone Benchmark which is considered as a typical set for some real-time applications.
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 001450
- to stream Crin, to step Curation: 001450
- to stream Crin, to step Checkpoint: 003096
- to stream Main, to step Merge: 00D394
- to stream Main, to step Curation: 00CB27
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="253">Performance Analysis of a Neural Network based Scheduling Algorithm</title></titleStmt><publicationStmt><idno type="RBID">CRIN:cardeira94b</idno><date when="1994" year="1994">1994</date><idno type="wicri:Area/Crin/Corpus">001450</idno><idno type="wicri:Area/Crin/Curation">001450</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">001450</idno><idno type="wicri:Area/Crin/Checkpoint">003096</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">003096</idno><idno type="wicri:Area/Main/Merge">00D394</idno><idno type="wicri:Area/Main/Curation">00CB27</idno><idno type="wicri:Area/Main/Exploration">00CB27</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Performance Analysis of a Neural Network based Scheduling Algorithm</title><author><name sortKey="Cardeira, C" sort="Cardeira, C" uniqKey="Cardeira C" first="C." last="Cardeira">C. Cardeira</name></author><author><name sortKey="Mammeri, Z" sort="Mammeri, Z" uniqKey="Mammeri Z" first="Z." last="Mammeri">Z. Mammeri</name></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>constraint optimization</term><term>neural network</term><term>real-time system</term><term>scheduling</term><term>timing</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="2188">In this paper, it is our purpose to analyse the use of artificial neural networks (ANNs) to approximate solving scheduling problems. It is well established that the ANN main advantage is the few amount of time they take to find an approximate solution, but a question arises\, : what about the optimality of the obtained solution ? A considerable variety of work has been carried out on this subject but, unfortunately, the majority of the studies have focused on the analysis of the classical TSP problem. The obtained results are useful as a reference but can not be directly extrapolated for real-time systems. It is our aim to analyse the behaviour of an ANN based scheduling algorithm when scheduling tasks in a real-time system, using the baseline task set from the Hartstone Benchmark which is considered as a typical set for some real-time applications.</div></front></TEI><affiliations><list></list><tree><noCountry><name sortKey="Cardeira, C" sort="Cardeira, C" uniqKey="Cardeira C" first="C." last="Cardeira">C. Cardeira</name><name sortKey="Mammeri, Z" sort="Mammeri, Z" uniqKey="Mammeri Z" first="Z." last="Mammeri">Z. Mammeri</name></noCountry></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00CB27 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00CB27 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= CRIN:cardeira94b
|texte= Performance Analysis of a Neural Network based Scheduling Algorithm
}}
| This area was generated with Dilib version V0.6.33. |  |